Graphs with exactly three vertices of the same degree
نویسندگان
چکیده
منابع مشابه
Transforming Graphs with the Same Degree Sequence
Let G and H be two graphs with the same vertex set V . It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H . We study the problem of finding the minimum number of 2-switches for transforming G into H .
متن کاملGraphs with the Same Peripheral and Center Eccentric Vertices
The eccentricity e(v) of a vertex v is the distance from v to a vertex farthest from v, and u is an eccentric vertex for v if its distance from v is d(u, v) = e(v). A vertex of maximum eccentricity in a graph G is called peripheral, and the set of all such vertices is the peripherian, denoted PeriG). We use Cep(G) to denote the set of eccentric vertices of vertices in C(G). A graph G is called ...
متن کاملOn Graphs with Adjacent Vertices of Large Degree
Let g(n, m) denote the class of simple graphs on n vertices and m edges and let C E 9( a, m). For suitably restricted values of m, C will necessarily contain certain prescribed subgraphs such as cycles of given lengths and complete graphs . For example> if m > 7nZ then G contains cycles of all lengths up to Li(n+ 3) J . Recently we have established a number of results concerning the existence o...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملStar multigraphs with three vertices of maximum degree
The graphs we consider here are either simple graphs, that is they have no loops or multiple edges, or are multigraphs, that is they may have more than one edge joining a pair of vertices, but again have no loops. In particular we shall consider a special kind of multigraph, called a star-multigraph: this is a multigraph which contains a vertex v*, called the star-centre, which is incident with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1978
ISSN: 0528-2195
DOI: 10.21136/cpm.1978.108616